Hierarchy in Fluid Construction Grammars
نویسندگان
چکیده
This paper reports further progress into a computational implementation of a new formalism for construction grammar, known as Fluid Construction Grammar (FCG). We focus in particular on how hierarchy can be implemented. The paper analyses the requirements for a proper treatment of hierarchy in grammar and then proposes a particular solution based on a new operator, known as the J-operator. The J-operator constructs a new unit as a side effect of the matching process.
منابع مشابه
Product-Free Lambek Calculus and Context-Free Grammars
In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we present a construction of context-free grammars involving only product-free types.
متن کاملFCGlight: Making the bridge between Fluid Construction Grammars and main-stream unification grammars by using feature constraint logics
Fluid Construction Grammars (FCGs) are a flavour of Construction Grammars, which themselves are unification-based grammars. Its syntax is (only) up to certain extent similar to other unification-based grammars. However, it lacks a declarative semantics, while its procedural semantics is truly particular, compared to other unification-based grammar formalisms. Here we propose the re-definition o...
متن کاملk-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings
This paper is concerned with learning categorial grammars in Gold’s model. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants but the question was left open for the weakest one, the non-associative variant NL. We show that the class of rigid and kvalued NL grammars is unlearnable from strings...
متن کاملPLANNING WHAT TO SAY: Second Order Semantics for Fluid Construction Grammars
Research in the origins and evolution of language has now reached a level where languages with grammatical structures are emerging in computer simulations and robotic experiments based on situated embodied language games played by populations of agents. This paper focuses on some of the technical AI issues related to this research. Specifically, we report on a system for planning complex meanin...
متن کاملAccepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کامل